Stream Ciphers and Linear Complexity
نویسنده
چکیده
The thesis mainly reviews the mathematical analysis of the security of stream ciphers. Firstly, we will introduce the background of stream ciphers with their design principles and theoretical security from the information theory viewpoint. Then we will introduce the algebraic tools for the analysis of linear recurring sequences followed by discussions on the two kinds of basic nonlinear filters. Also, we will discuss the randomness of the sequences over Fq and justify the use of linear complexity profiles to measure the randomness of the key streams generated by linear feedback shift registers. An exploration of the probabilistic properties of sequences over Fq is included too. Finally, we define an important parameter k-error linear complexity to measure the security of the key streams and discuss the lower bounds for this parameter of periodic sequences over Fq. Chapter 1 Stream Ciphers and Their Realizations In this chapter, we will give a general picture of stream ciphers.
منابع مشابه
On the computational complexity of finding a minimal basis for the guess and determine attack
Guess-and-determine attack is one of the general attacks on stream ciphers. It is a common cryptanalysis tool for evaluating security of stream ciphers. The effectiveness of this attack is based on the number of unknown bits which will be guessed by the attacker to break the cryptosystem. In this work, we present a relation between the minimum numbers of the guessed bits and uniquely restricted...
متن کاملبهبود حمله حدس و تعیین اکتشافی به سامانه های رمز جریانی TIPSY و SNOW1.0
Guess and determine attacks are general attacks on stream ciphers. These attacks are classified into ad-hoc and Heuristic Guess and Determine (HGD) attacks. One of the Advantages of HGD attack algorithm over ad-hoc attack is that it is designed algorithmically for a large class of stream ciphers while being powerful. In this paper, we use auxiliary polynomials in addition to the original equati...
متن کاملStream ciphers and the eSTREAM project
Stream ciphers are an important class of symmetric cryptographic algorithms. The eSTREAM project contributed significantly to the recent increase of activity in this field. In this paper, we present a survey of the eSTREAM project. We also review recent time/memory/data and time/memory/key trade-offs relevant for the generic attacks on stream ciphers.
متن کاملError linear complexity measures for multisequences
Complexity measures for sequences over finite fields, such as the linear complexity and the k-error linear complexity, play an important role in cryptology. Recent developments in stream ciphers point towards an interest in word-based stream ciphers, which require the study of the complexity of multisequences. We introduce various options for error linear complexity measures for multisequences....
متن کاملAlgebraic Attacks on Stream Ciphers (survey)
Most stream ciphers based on linear feedback shift registers (LFSR) are vulnerable to recent algebraic attacks. In this survey paper, we describe generic attacks: existence of algebraic equations and fast algebraic attacks. The generic attacks only states the existence and gives the upper bound of the complexity. Thus we should find good algebraic equations, case by case, in order to apply the ...
متن کامل